Newton’s Method for Generalized Equations: a Sequential Implicit Function Theorem1
نویسنده
چکیده
In the extension of Newton’s method to generalized equations, applying to variational inequalities as a special case, convergence analysis relates to a corresponding implicit function theorem, describes how solutions may depend on a parameter. In this paper the implicit function paradigm is carried further and placed in the framework of a mapping from the parameter to sequence of iterates as elements of a sequence space,
منابع مشابه
Newton's method for generalized equations: a sequential implicit function theorem
In an extension of Newton’s method to generalized equations, we carry further the implicit function theorem paradigm and place it in the framework of a mapping acting from the parameter and the starting point to the set of all associated sequences of Newton’s iterates as elements of a sequence space. An inverse function version of this result shows that the strong regularity of the mapping asso...
متن کاملSequential Implicit Numerical Scheme for Pollutant and Heat Transport in a Plane-Poiseuille Flow
A sequential implicit numerical scheme is proposed for a system of partial differential equations defining the transport of heat and mass in the channel flow of a variable-viscosity fluid. By adopting the backward difference scheme for time derivative and the central difference scheme for the spatial derivatives, an implicit finite difference scheme is formulated. The variable-coefficient diffu...
متن کاملThe Implicit Function Theorem with Applications in Dynamics and Control
The implicit function theorem is a statement of the existence, continuity, and differentiability of a function or set of functions. The theorem is closely related to the convergence of Newton’s method for nonlinear equations, the existence and uniqueness of solutions to nonlinear differential equations, and the sensitivity of solutions to these nonlinear problems. The implicit function theorem ...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA fully implicit Finite-difference solution to one dimensional Coupled Nonlinear Burgers’ equations
A fully implicit finite-difference method has been proposed for the numerical solutions of one dimensional coupled nonlinear Burgers’ equations on the uniform mesh points. The method forms a system of nonlinear difference equations which is to be solved at each iteration. Newton’s iterative method has been implemented to solve this nonlinear assembled system of equations. The linear system has ...
متن کامل